The volume of digital Text data is continuously increasing both online and offline storage, which makes it difficult to read across documents on a particular topic and find the desired information within a possible available time. This necessitates the use of technique such as automatic Text Summarization. Many approaches and algorithms have been proposed for automatic Text Summarization including; supervised machine learning, clustering, graph-based and lexical chain, among others. This paper presents a novel systematic review of various graph-based automatic Text Summarization models.

Text Summarization is the process of condensing a source Text while retaining its key points, tailored to a specific audience or task. The research Extractive Summarization, where each news article was segmented into individual sentences. Each sentence underwent processing through the ParsBERT algorithm. Subsequently, an attention layer combined the sentence weights with the Bidirectional GRU algorithm's output to extract summarized sentences for labeling. The dataset comprised over 175,000 articles sourced from reputable Persian news agencies (ISNA-TASNIM), covering various topics such as science, politics, and sports. Evaluation of the Summarization techniques was conducted using Rouge metrics. The results of the investigation revealed precision values of 0.7923 (Rouge-1), 0.7613 (Rouge-2), and 0.8582 (Rouge-L). The study also evaluated the effectiveness of Gated Recurrent Unit (GRU) algorithms in Extractive Summarization by integrating its architecture with the attention network. The results demonstrated an improvement in news Text Summarization compared to other deep learning hybrid algorithms.

Extractive Summarization of Text is an essential technique in natural language processing, which helps to produce compact versions of Text by extracting the most important sentences. Since the task of shortening and summarizing a Text document is time-consuming and exhausting, an automatic system for creating these short versions of the Text seems necessary. In Extractive Summarization, sentences that contain useful and relevant information are usually selected for the final summary. In order to identify these sentences, there are different algorithms, the performance and summary created by each one is different based on the type and scope of the Text and the size of the required summary. In this article, a method called Sa-TRB is presented, which is derived from two algorithms, TextRank and BERT, and in addition to using these two methods, it also uses the common sentences created by other algorithms to achieve high accuracy in selection. Have final summary sentences. The most important criterion for evaluating the performance of algorithms is the quality of their final summary, so the more the final summary created by these algorithms is similar to the summary created by humans, the better the quality of the created summary is. ROUGE criteria have been used to obtain the size of this similarity. Finally, by conducting experiments on the cnn-dailymail dataset with different sizes of summaries, it is shown that the proposed method, by increasing the size of the required summaries, despite the decrease in the recall criterion, has accuracy, score and, as a result, higher quality of the final summaries. So, in the last two tests, the score of the proposed method has reached 24.68 and 23.34%, which is almost one percent better than the best tested methods.

With increasing production of information in many fields, Information Retrieval Systems gain much importance. But the more important systems are the summarizers that can make a single summary from all documents retrieved. Because a user can read a summary that is full of information of retrieved Texts is much more easier than all of that Texts so these summarizers are so important. This paper offers an approach for producing such summary from multidocument that retrieve. A multi-document summarizing system is different from a single document and this difference is for some points like compression, speed, anti redundancy and cohesion of the summary.

A survey on Automatic Text SummariText Summarization endeavors to produce a summary version of a Text, while maintaining the original ideas. The Textual content on the web, in particular, is growing at an exponential rate. The ability to decipher through such a massive amount of data to extract useful information is a significant undertaking, and requires an automatic mechanism to aid with the extant repository of information. The Text Summarization systems intent to assist with content reduction keeping the relevant information and filtering the non-relevant parts of the Text. In terms of the input, there are two fundamental approaches among the Text Summarization systems. The first approach summarizes a single document. In other words, the system takes one document as an input and produces a summary version as its output. An alternative approach is to take several documents as its input and produce a single summary document as its output. In terms of output, the Summarization systems are also categorized into two major types. One approach would be to extract exact sentences from the original document to build the summary output. An alternative would be a more complex approach, in which the rendered Text is a rephrased version of the original document. This paper will offer an in-depth introduction to automatic Text Summarization. We also mention some evaluation techniques to evaluate the quality of automatic Text Summarization. zation

Due to the explosive growth of the world-wide web, automatic Text Summarization has become an essential tool for web users. In this pa- per, we present a novel approach for creating Text summaries. Using fuzzy logic and word-net, our model extracts the most relevant sentences from an original document. The approach utilizes fuzzy measures and inference on the extracted Textual information from the document to find the most significant sentences. Experimental results reveal that the proposed approach extracts the most relevant sentences when compared to other commercially available Text summarizers. Text pre-processing based on word-net and fuzzy analysis is the main part of our work.

The progress of communications over internet media such as social media and messengers has led to the production of large amount of Textual data. This kind of information contains a lot of valuable knowledge and can be used to improve the performance of other natural language processing (NLP) tasks. There are several ways to use such information, of which one is Text Summarization. Summarizing Textual information can extract the main content of Text within a short time. In this paper, we propose an approach for Extractive Summarization on Persian Texts by using sentences embedding and a sparse coding framework. Most previous works focuses on Text’s sentences individually which may not consider the hidden structure patterns between them. In this paper, our proposed approach can consider the relations between the Text’s sentences by using three main criteria, namely coverage, diversity and sparsity, when selecting the summary sentences. By considering these criteria, we select sentences that can reconstruct the whole Text with least reconstruction error. The proposed approach is evaluated on Persian dataset Pasokh and achieved 10. 02% and 8. 65% improvement compared to the state-of-the-art methods in rouge-1 and rouge-2 f-scores, respectively. We show that considering semantic relations among the Text’s sentences can lead us to better sentence Summarization.

The progress of communications over internet media such as social media and messengers has led to the production of large amount of Textual data. This kind of information contains a lot of valuable knowledge and can be used to improve the performance of other natural language processing (NLP) tasks. There are several ways to use such information, of which one is Text Summarization. Summarizing Textual information can extract the main content of Text within a short time. In this paper, we propose an approach for Extractive Summarization on Persian Texts by using sentences embedding and a sparse coding framework. Most previous works focuses on Text’ s sentences individually which may not consider the hidden structure patterns between them. In this paper, our proposed approach can consider the relations between the Text’ s sentences by using three main criteria, namely coverage, diversity and sparsity, when selecting the summary sentences. By considering these criteria, we select sentences that can reconstruct the whole Text with least reconstruction error. The proposed approach is evaluated on Persian dataset Pasokh and achieved 10. 02% and 8. 65% improvement compared to the state-of-theart methods in rouge-1 and rouge-2 f-scores, respectively. We show that considering semantic relations among the Text’ s sentences can lead us to better sentence Summarization.

Today, with rapid growth of the World Wide Web and creation of Internet sites and online Text resources, Text Summarization issue is highly attended by various researchers. Extractive-based Text Summarization is an important Summarization method which is included of selecting the top representative sentences from the input document. When, we are facing into large data volume documents, the Extractive-based Text Summarization seems to be an unsolvable problem. Therefore, to deal with such problems, meta-heuristic techniques are applied as a solution. In this paper, we used Cuckoo Search Optimization Algorithm (CSOA) to improve performance of Extractive-based Summarization method. The proposed approach is examined on Doc. 2002 standard documents and analyzed by Rouge evaluation software. The obtained results indicate better performance of proposed method compared with other similar techniques.